Eco-reliable path finding in time-variant and stochastic networks
نویسندگان
چکیده
منابع مشابه
Reliable shortest path finding in stochastic networks with spatial correlated link travel times
Reliable shortest path finding in stochastic networks with spatial correlated link travel times Bi Yu Chen a b , William H.K. Lam a , Agachai Sumalee a & Zhi-lin Li c a Department of Civil and Structural Engineering, The Hong Kong Polytechnic University, Hong Kong, PR China b State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, PR Ch...
متن کاملPath-Finding in Networks
Algorithms that find connections between concepts in semantic networks are inherently inefficient due to their dependence on piecemeal representation of potential paths. A method of reorganizing a link-based network into a path-based representation is argued to allow more efficient search techniques. A path-based representation is presented in terms of the knowledge representation language Conc...
متن کاملMulti-objective path finding in stochastic time-dependent road networks using non-dominated sorting genetic algorithm
In this paper, a new multi-objective path-finding model is proposed to find optimal paths in road networks with time-dependent stochastic travel times. This study is motivated by the fact that different travelers usually have different route-choice preferences, often involving multiple conflicting criteria such as expected path travel time, variance of path travel time and so forth. However, mo...
متن کاملOptimal Path Finding Method Study Based on Stochastic Travel Time
Finding optimal path in a given network is an important content of intelligent transportation information service. Static shortest path has been studied widely and many efficient searching methods have been developed, for example Dijkstra’s algorithm, Floyd-Warshall, Bellman-Ford, A et al. However, practical travel time is not a constant value but a stochastic value. How to take full use of the...
متن کاملFinding Risk-Averse Shortest Path with Time-Dependent Stochastic Costs
In this paper, we tackle the problem of risk-averse route planning in a transportation network with time-dependent and stochastic costs. To solve this problem, we propose an adaptation of the A* algorithm that accommodates any risk measure or decision criterion that is monotonic with first-order stochastic dominance. We also present a case study of our algorithm on the Manhattan, NYC, transport...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy
سال: 2017
ISSN: 0360-5442
DOI: 10.1016/j.energy.2017.01.008